- intuitionistic proof
- интуиционистский вывод
Англо-русский словарь по исследованиям и ноу-хау. Е.Г. Коваленк. 2015.
Англо-русский словарь по исследованиям и ноу-хау. Е.Г. Коваленк. 2015.
Intuitionistic logic — Intuitionistic logic, or constructive logic, is a symbolic logic system differing from classical logic in its definition of the meaning of a statement being true. In classical logic, all well formed statements are assumed to be either true or… … Wikipedia
Intuitionistic type theory — Intuitionistic type theory, or constructive type theory, or Martin Löf type theory or just Type Theory is a logical system and a set theory based on the principles of mathematical constructivism. Intuitionistic type theory was introduced by Per… … Wikipedia
Proof theory — is a branch of mathematical logic that represents proofs as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively defined data structures such as plain lists, boxed… … Wikipedia
Proof-theoretic semantics — is an approach to the semantics of logic that attempts to locate the meaning of propositions and logical connectives not in terms of interpretations, as in Tarskian approaches to semantics, but in the role that the proposition or logical… … Wikipedia
Proof complexity — In computer science, proof complexity is a measure of efficiency of automated theorem proving methods that is based on the size of the proofs they produce. The methods for proving contradiction in propositional logic are the most analyzed. The… … Wikipedia
Proof calculus — In mathematical logic, a proof calculus corresponds to a family of formal systems that use a common style of formal inference for its inference rules. The specific inference rules of a member of such a family characterize the theory of a… … Wikipedia
intuitionistic — adjective Dealing strictly in constructive proofs, abstaining from proof by contradiction. See Also: intuition … Wiktionary
Mathematical proof — In mathematics, a proof is a convincing demonstration (within the accepted standards of the field) that some mathematical statement is necessarily true.[1][2] Proofs are obtained from deductive reasoning, rather than from inductive or empirical… … Wikipedia
Formal proof — See also: mathematical proof, proof theory, and axiomatic system A formal proof or derivation is a finite sequence of sentences (called well formed formulas in the case of a formal language) each of which is an axiom or follows from the… … Wikipedia
Constructive proof — In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object with certain properties by creating or providing a method for creating such an object. This is in contrast to a nonconstructive… … Wikipedia
Russell's paradox — Part of the foundations of mathematics, Russell s paradox (also known as Russell s antinomy), discovered by Bertrand Russell in 1901, showed that the naive set theory of Frege leads to a contradiction.It might be assumed that, for any formal… … Wikipedia